EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 166

$\infty$ -regular languages defined by a limit operator.

Mikulášek, Karel (1996)

Mathematica Pannonica

$3 x + 1$ minus the $+$ .

Monks, Kenneth G. (2002)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

5-abelian cubes are avoidable on binary alphabets

Robert Mercaş, Aleksi Saarela (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A k-abelian cube is a word uvw, where the factors u, v, and w are either pairwise equal, or have the same multiplicities for every one of their factors of length at most k. Previously it has been shown that k-abelian cubes are avoidable over a binary alphabet for k ≥ 8. Here it is proved that this holds for k ≥ 5.

$94$ -пространства.

Ю.Л. Ершов (1999)

Algebra i Logika

Łukasiewicz language and diagonals of formal series. (Langage de Łukasiewicz et diagonales de séries formelles.)

Fagnot, Isabelle (1996)

Journal de Théorie des Nombres de Bordeaux

$β$ -shift, systèmes de numération et automates

Nathalie Loraud (1995)

Journal de théorie des nombres de Bordeaux

In this note we prove that the language of a numeration system is the language of a $_{β}$ -shift under some assumptions on the basis. We deduce from this result a partial answer to the question when the language of a numeration system is regular. Moreover, we give a characterization of the arithmetico-geometric sequences and the mixed radix sequences that are basis of a numeration system for which the language is regular. Finally, we study the Ostrowski systems of numeration and give another proof of...

$ε$ -энтропия компактов в $C$ и табулирование непрерывных функций.

В.Н. Потапов (1997)

Sibirskij matematiceskij zurnal

$μ$ -bicomplete categories and parity games

Luigi Santocanale (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

For an arbitrary category, we consider the least class of functors containing the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of functors that are definable by $μ$ -terms. We call the category $μ$ -bicomplete if every $μ$ -term defines a functor. We provide concrete examples of such categories and explicitly characterize this class of functors for the category of sets and functions. This goal is achieved...

μ-Bicomplete Categories and Parity Games

Luigi Santocanale (2010)

RAIRO - Theoretical Informatics and Applications

For an arbitrary category, we consider the least class of functors containing the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of functors that are definable by μ-terms. We call the category μ-bicomplete if every μ-term defines a functor. We provide concrete examples of such categories and explicitly characterize this class of functors for the category of sets and functions. This goal is achieved...